Compact and Scalable Elliptic Curve Crypto Processor in Binary Field

نویسندگان

  • A.Suhirtha Subha
  • Rahila Bilal
چکیده

Elliptic Curve Cryptography plays a vital role in securing the information for the past two decades. Implementing ECC in hardware is more efficient than software. A processor is said to be compact, if its implementation space is small compared to its execution speed and is scalable if this processor is used with different key sizes. Different metrics such as execution time, implementation space and energy consumption are used to quantitatively measure the performance of ECC processor. This ECC processor consumes 87 %, 92 % of the I/O pins from Quartus 10.1 Arria GX namely EP1AGX50DF1152C6, Cyclone III namely EP3C40F780C6 respectively. This also consumes the power of 671.12 mW in 44 ms and 150.39 mW in 40 ms from Quartus 10.1 Arria GX namely EP1AGX50DF1152C6, Cyclone III namely EP3C40F780C6 respectively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Study of Suitability and Effectiveness of Various Implementation Options Of Finite Field Arithmetic on Elliptic Curve Crypto System

389 Abstract—Finite field or Galois field plays an important role in efficient architecture design and implementation of Elliptic curve cryptosystem. A lot of research work is going on in this area since it is suitable for cryptography as well as error correcting codes useful for digital communication, compact disks etc. In this paper we discuss the basic concepts of finite field and its applic...

متن کامل

Design and Evaluation of Parallel , Scalable ,Curve Based Processor over Binary Field

Implementing Public-Key cryptography systems is a challenge for most application platforms when several factors have to be considered in selecting the implementation platform. Elliptic Curve Cryptography is considered much more suitable than other public-key algorithms. It uses lower power consumption, has higher performance and can be implemented on small areas that can be achieved by using EC...

متن کامل

Fast 160-Bits GF (P) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers

In this paper, a fast hardware architecture for elliptic curve cryptography computation in Galois Field GF(p) is proposed. The architecture is implemented for 160-bits, as its data size to handle. The design adopts projective coordinates to eliminate most of the required GF(p) inversion calculations replacing them with several multiplication operations. The hardware is intended to be scalable, ...

متن کامل

Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2) Field Multipliers

This study presents a high performance GF(2) Elliptic Curve Crypto-processor architecture. The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. In the proposed architecture, normal basis representation is used. Comparisons between the Projective, Jacobian and Mixed coordinate systems using sequential and parallel designs ar...

متن کامل

Efficient FPGA Implementation of a Programmable Architecture for GF(p) Elliptic Curve Crypto Computations

This paper presents a processor architecture for elliptic curve cryptography computations over GF(p). The speed to compute the Elliptic-curve point multiplication over the prime fields GF(p) is increased by using the maximum degree of parallelism, and by carefully selecting the most appropriate coordinates system. The proposed Elliptic Curve processor is implemented using FPGAs. The time, area ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014